Embeddings of Pfaffian Braces and Polyhex Graphs

نویسندگان

  • DONG YE
  • HEPING ZHANG
چکیده

Let G be a graph admitting a perfect matching. A cycle of even size C is central if G − C has a perfect matching. Given an orientation to G, an even cycle C is oddly oriented if along either direction of traversal around C, the number of edges of C with the direction as the same as the traversal direction is odd. An orientation of G is Pfaffian if every central cycle of G is oddly oriented. A graph G is Pfaffian if it has a Pfaffian orientation. In this paper, we show that every embedding of a Pfaffian brace on a surface with positive genus has face-width at most three and that the cyclic edgeconnectivity of a Pfaffian cubic brace different from the Heawood graph is four. Finally, we characterize all Pfaffian polyhex graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces

A graph G with a perfect matching is Pfaffian if it admits an orientation D such that every central cycle C (i.e. C is of even size and G − V (C) has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfa...

متن کامل

Pfaffian labelings and signs of edge colorings

We relate signs of edge-colorings (as in classical Penrose’s result) with “Pfaffian labelings”, a generalization of Pfaffian orientations, whereby edges are labeled by elements of an Abelian group with an element of order two. In particular, we prove a conjecture of Goddyn that all k-edge-colorings of a k-regular Pfaffian graph G have the same sign. We characterize graphs that admit a Pfaffian ...

متن کامل

Labeling Subgraph Embeddings and Cordiality of Graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

متن کامل

Matching signatures and Pfaffian graphs

We prove that every 4-Pfaffian that is not Pfaffian essentially has a unique signature matrix. We also give a simple composition Theorem of 2r-Pfaffian graphs from r Pfaffian spanning subgraphs. We apply these results and exhibit a graph that is 6-Pfaffian but not 4-Pfaffian. This is a counter-example to a conjecture of Norine [5], which states that if a graph G is k-Pfaffian but not (k − 1)-Pf...

متن کامل

Minimally non-Pfaffian graphs

We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sharp contrast with the bipartite case, as Little [7] proved that every bipartite non-Pfaffian graph contains a matching minor isomorphic to K3,3. We relax the notion of a matching minor and conjecture that there are onl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009